Web Service Interaction Modeling and Verification Using Recursive Composition Algebra
نویسندگان
چکیده
Syntax Tree Generator (Alg. 4) specification
منابع مشابه
Algebraic Modeling and Verification of Web Service Composition
In order to provide a rigorous and sound foundation for formal reasoning about Web services, algebraic modeling is one of the important techniques used as is witnessed from the Web service literature. However, the algebraic modeling approach for Web services (Web service algebra) is still in its infancy. To further facilitate the algebraic modeling of Web services, in this paper, we propose a c...
متن کاملA model for specification, composition and verification of access control policies and its application to web services
Despite significant advances in the access control domain, requirements of new computational environments like web services still raise new challenges. Lack of appropriate method for specification of access control policies (ACPs), composition, verification and analysis of them have all made the access control in the composition of web services a complicated problem. In this paper, a new indepe...
متن کاملWeb Service Choreography Verification Using Z Formal Specification
Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...
متن کاملFormal Modeling and Verification for Web Service Composition
Web service composition is an important reuse way of service resources, through which large scale and complex applications based on Internet can get the newer and more reliable resources among the distributed nodes. An important challenge for web services composition is how to ensure the correctness and reliability of the composition process. CPN(Colored Petri Net)as a formal modeling and verif...
متن کاملA Bounded Model Checking Approach for the Verification of Web Services Composition
In this paper, we propose a bounded model-checking based approach for the verification of declarative Web services composition processes using satisfiability solving (SAT). The need for the bounded model-checking approach stems from the nature of declarative processes as they are defined by only specifying the constraints that mark the boundary of the solution to the composition process. The pr...
متن کامل